The prize-collecting generalized minimum spanning tree problem
نویسندگان
چکیده
منابع مشابه
The prize-collecting generalized minimum spanning tree problem
The prize-collecting generalized minimum spanning tree (PC-GMST) is defined as follows: Given an undirected graph G = (V, E), with node set V, edge set E, cost vector c ∈ R|E| + on the edges E, prize vector p ∈ R|V | + on the nodes V, and a set of K mutually exclusive and exhaustive node sets V1, ..., VK (i.e., V1 ⋂ Vj = ∅, if i 6= j, and Kk=1 Vk = V ), find a minimum cost tree spanning exactly...
متن کاملThe Generalized Minimum Spanning Tree Problem
We consider the Generalized Minimum Spanning Tree Problem denoted by GMSTP. It is known that GMSTP is NP-hard and even finding a near optimal solution is NP-hard. We introduce a new mixed integer programming formulation of the problem which contains a polynomial number of constraints and a polynomial number of variables. Based on this formulation we give an heuristic solution, a lower bound pro...
متن کاملThe Prize Collecting Steiner Tree Problem
This work is motivated by an application in local access network design that can be modeled using the KP-hard Prize Collecting Steiner Tree problem. We consider several variants on this problem and on the primal-dual 2-approximation algorithm devised for it by Goemans and Williamson. We develop several modifications to the algorithm which lead to theoretical as well as practical improvements in...
متن کاملSolving the generalized minimum spanning tree problem with simulated annealing
We consider a generalization of the minimum spanning tree problem, called the generalized minimum spanning tree problem, denoted by GMST. It is known that the GMST problem is NP-hard. We present an effective algorithm for this problem. The method combines a simulated annealing algorithm (SA) with a local greedy algorithm. The heuristic that we proposed found solutions that were optimal for grap...
متن کاملHeuristic Algorithms for the Generalized Minimum Spanning Tree Problem
We consider a generalization of the classical minimum spanning tree problem called the generalized minimum spanning tree problem and denoted by GMST problem. The aim of this paper is to present an exact exponential time algorithm for the GMST problem as well three heuristic algorithms, two of them based on Prim’s and Kruskal’s algorithms for the minimum spanning tree problem and one based on th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Heuristics
سال: 2007
ISSN: 1381-1231,1572-9397
DOI: 10.1007/s10732-007-9027-1